Memory Management for Dataflow Programming of Multirate Signal Processing Algorithms1
نویسندگان
چکیده
Managing the buffering of data along arcs is a critical part of compiling a synchronous dataflow (SDF) program. This paper shows how dataflow properties can be analyzed at compile-time to make buffering more efficient. Since the target code corresponding to each node of an SDF graph is normally obtained from a hand-optimized library of predefined blocks, the efficiency of data transfer between blocks is often the limiting factor in how closely an SDF compiler can approximate meticulous manual coding. Furthermore, in the presence of large sample-rate changes, straightforward buffering techniques can quickly exhaust limited on-chip data memory, necessitating the use of slower external memory. The techniques presented in this paper address both of these problems in a unified manner.
منابع مشابه
Looped Schedules for Dataflow Descriptions of Multirate Signal Processing Algorithms1
The synchronous dataflow (SDF) programming paradigm has been used extensively in design environments for multirate signal processing applications. In this paradigm, the repetition of computations is specified by the relative rates at which the computations consume and produce data. This implicit specification of iteration allows a compiler to easily explore alternative nested loop structures fo...
متن کاملShared Memory Implementations of Synchronous Dataflow Specifications Using Lifetime Analysis Techniques
There has been a proliferation of block-diagram environments for specifying and prototyping DSP systems. These include tools from academia like Ptolemy [6], and commercial tools like SPW from Cadence Design Systems, and Cossap from Synopsys. The block diagram languages used in these environments are usually based on dataflow semantics because various subsets of dataflow have proven to be good m...
متن کاملAn efficient timing model for hardware implementation of multirate dataflow graphs
We consider the problem of representing timing information associated with functions in a dataflow graph used to represent a signal processing system in the context of high-level hardware (architectural) synthesis. This information is used for synthesis of appropriate architectures for implementing the graph. Conventional models for timing suffer from shortcomings that make it difficult to repr...
متن کاملA Generalization of Multidimensional Synchronous Dataflow to Arbitrary Sampling Lattices
Multidimensional Synchronous Dataflow (MDSDF) [15][7] is a model of computation that has been proposed for specifying multidimensional multirate signal processing systems such as image and video processing algorithms. The model is an extension of synchronous dataflow (SDF) [14] and has all of the desirable properties of the SDF model such as static schedulability, exposition of data and functio...
متن کامل